Sparse shift-varying FIR preconditioners for fast volume denoising
نویسندگان
چکیده
Splitting-based CT reconstruction algorithms decompose the reconstruction problem into a iterated sequence of “easier” subproblems. One relatively memory-efficient algorithm decomposes the reconstruction problem into a several subproblems, including a volume denoising problem. While easier to solve in isolation than jointly, these subproblems have highly shiftvarying Hessians that are challenging to effectively precondition with circulant operators. In this work, we present an algorithm to design a positive-definite, Schatten p-norm optimal, finite impulse response (FIR) approximation to a given circulant matrix. With this algorithm, we generate efficient space-varying preconditioners for the volume denoising problem. We demonstrate that PCG with an efficient space-varying preconditioner can converge at least quickly as a split-Bregman-like algorithm while using considerably less memory.
منابع مشابه
Efficient Preconditioning Strategies for the Multilevel Fast Multipole Algorithm
For the iterative solutions of the integral equation methods employing the multilevel fast multipole algorithm (MLFMA), effective preconditioning techniques should be developed for robustness and efficiency. Preconditioning techniques for such problems can be broadly classified as fixed preconditioners that are generated from the sparse near-field matrix and variable ones that can make use of M...
متن کاملA Novel Image Denoising Method Based on Incoherent Dictionary Learning and Domain Adaptation Technique
In this paper, a new method for image denoising based on incoherent dictionary learning and domain transfer technique is proposed. The idea of using sparse representation concept is one of the most interesting areas for researchers. The goal of sparse coding is to approximately model the input data as a weighted linear combination of a small number of basis vectors. Two characteristics should b...
متن کاملA Class of Efficient Preconditioners with Multilevel Sequentially Semiseparable Matrix Structure
This paper presents a class of preconditioners for sparse systems arising from discretized partial differential equations (PDEs). In this class of preconditioners, we exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. The off-diagonal blocks of MSSS matrices are of low-rank, which enables fast computations of linear complexity. In order to keep the low-rank...
متن کاملDeblocking Joint Photographic Experts Group Compressed Images via Self-learning Sparse Representation
JPEG is one of the most widely used image compression method, but it causes annoying blocking artifacts at low bit-rates. Sparse representation is an efficient technique which can solve many inverse problems in image processing applications such as denoising and deblocking. In this paper, a post-processing method is proposed for reducing JPEG blocking effects via sparse representation. In this ...
متن کاملStructured preconditioners for nonsingular matrices of block two-by-two structures
For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of practical and efficient structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block GaussSeidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely de...
متن کامل